An Efficient Denotational Semantics for Natural Language Database Queries
نویسندگان
چکیده
Early work on natural language database query processing focused on theories of compositional semantics. Recent work concentrates on the translation of NL queries to SQL where semantics is primarily used in an ad hoc manner to guide syntactic translation. Here, we argue that there remains a need for an efficiently-implementable denotational semantics for NL DB queries, and show how this can be achieved by integrating a relatively little-known semantics for transitive verbs with a new efficiently-implementable semantics for negation.
منابع مشابه
An Event-Driven Approach for Querying Graph-Structured Data Using Natural Language
An ideal way for people to query graph-based knowledge, including triplestores in the semantic web, would be for them to ask questions in a natural language (NL). However, existing NL query interfaces to graph-based data have limited expressive power and cannot accommodate arbitrarilynested quantification (i.e. phrases such as “a gangster who joined every gang”) together with multiple complex p...
متن کاملA Semantic Basis for Proof Queries and Transformations
We add updates to the query language PrQL, designed for inspecting machine representations of proofs. PrQL natively supports hiproofs that express proof structure using hierarchically nested labelled trees, which we claim is a natural way of taming the complexity of huge proofs. Query-driven updates allow us to change this structure, in particular, to transform proofs produced by interactive th...
متن کاملQuery Combinators
We introduce Rabbit, a combinator-based query language. Rabbit is designed to let data analysts and other accidental programmers query complex structured data. We combine the functional data model and the categorical semantics of computations to develop denotational semantics of database queries. In Rabbit, a query is modeled as a Kleisli arrow for a monadic container determined by the query ca...
متن کاملA Formal Description of XML Tree Pattern Query for XQuery Language
In order to express tree pattern query in query plan and take advantage of formal method to analyze its behavioral characteristics, this paper present a formal description of tree pattern query based on functional language and denotational semantics. This description major focuses on behavior of a tree pattern query on matching against an eXtensible Markup Language (XML) document tree. First, w...
متن کاملEvaluation of XPath Fragments Using Lambda Calculi
XML Path Language (XPath) is the most important standard for navigation within XML documents nowadays. In this paper we present the state of our current research that is focused on using a functional framework based on simply typed lambda calculi and a general type system XML-λ for description of semantics of a query language. With such formalism we are able to describe the semantics of all lan...
متن کامل